Computing Nash Equilibria in Generalized Interdependent Security Games: Supplementary Material
نویسندگان
چکیده
In the following, we assume, without loss of generality, that for all players i, Ri > 0, δi > 0, pi > 0, and αi > 0. Given a joint mixed-strategy x, we partition the players by type w.r.t. x: let I ≡ I(x) ≡ {i | xi = 1}, N ≡ N(x) ≡ {i | xi = 0}, and P ≡ P (x) ≡ {i | 0 < xi < 1} be the set of players that fully invest in protection, do not invest in protection, and partially invest in protection, respectively.
منابع مشابه
Computing Nash Equilibria in Generalized Interdependent Security Games
We study the computational complexity of computing Nash equilibria in generalized interdependent-security (IDS) games. Like traditional IDS games, originally introduced by economists and risk-assessment experts Heal and Kunreuther about a decade ago, generalized IDS games model agents’ voluntary investment decisions when facing potential direct risk and transfer-risk exposure from other agents....
متن کاملInterdependent Defense Games: Modeling Interdependent Security under Deliberate Attacks
We propose interdependent defense (IDD) games, a computational game-theoretic framework to study aspects of the interdependence of risk and security in multi-agent systems under deliberate external attacks. Our model builds upon interdependent security (IDS) games, a model due to Heal and Kunreuther that considers the source of the risk to be the result of a fixed randomizedstrategy. We adapt I...
متن کاملInterdependent Security Games Under Behavioral Probability Weighting
We consider a class of interdependent security games where the security risk experienced by a player depends on her own investment in security as well as the investments of other players. In contrast to much of the existing work that considers risk neutral players in such games, we investigate the impacts of behavioral probability weighting by players while making security investment decisions....
متن کاملProjected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...
متن کاملTractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games (GMhGs), which are generalizations of normal-form games, graphical games, graphical polymatrix games, and hypergraphical games. Computing an exact mixed-strategy Nash equilibria in graphical polymatrix games is PPADcomplete and ...
متن کامل